Tableau-based bisimulation invariance testing
نویسنده
چکیده
tableau for that formula. The test generally does not terminate, but it does if a given formula is bisimulation invariant, i.e., the test is positive.
منابع مشابه
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goal-directed rules. The decision procedure also provides the essential part of the bisimulation relation betwe...
متن کاملModel Checking Fixed Point Logic with Chop
This paper examines FLC, which is the modal μ-calculus enriched with a sequential composition operator. Bisimulation invariance and the tree model property are proved. Its succinctness is compared to the modal μ-calculus. The main focus lies on FLC’s model checking problem over finite transition systems. It is proved to be PSPACE-hard. A tableau model checker is given and an upper EXPTIME bound...
متن کاملTowards characterizing bisimilarity of value-passing processes with context-free control
A value-passing version of normed context-free processes is considered, where process behaviours depend on a global state of data variables. The problem of characterizing bisimilarity of such processes is posed. A solution of the formulated problem is presented for a restricted class of processes and possibilities of extending the result are discussed. The presented solution exploits a tableau ...
متن کاملWhen Are Two Arguments the Same? Invariance in Abstract Argumentation∗
The paper proposes the use of modal logic methods for the development of suitable notions of invariance for abstract argumentation. In particular, it investigates the use of bisimulation and quasi-injective bisimulation as adequate forms of invariance for the argumentation-theoretic notions of grounded extension and of credulous admissibility.
متن کاملBisimulation Minimization and Symbolic Model Checking
State space minimization techniques are crucial for combating state explosion. A variety of explicitstate verification tools use bisimulation minimization to check equivalence between systems, to minimize components before composition, or to reduce a state space prior to model checking. Experimental results on bisimulation minimization in symbolic model checking contexts, however, are mixed. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reports on Mathematical Logic
دوره 48 شماره
صفحات -
تاریخ انتشار 2013